Multi-player Approximate Nash Equilibria
نویسندگان
چکیده
In this paper we study the complexity of finding approximate Nash equilibria in multi-player normal-form games. First, for any constant number n, we present a polynomial-time algorithm for computing a relative ( 1− 1 1+(n−1)n ) -Nash equilibrium in arbitrary nplayer games and a relative ( 1− 1 1+(n−1)n−1 ) -Nash equilibrium in symmetric n-player games. Next, we show that there is an additive ε-well-supported Nash equilibrium, for any ε > 0, with support equal to O(ln(nm/ε)/ε2), where m is the number of pure strategies. Finally, we prove that finding additive approximate Nash equilibria is easy in random multi-player games.
منابع مشابه
Approximate and Well-supported Approximate Nash Equilibria of Random Bimatrix Games
We focus on the problem of computing approximate Nash equilibria and well-supported approximate Nash equilibria in random bimatrix games, where each player's payoffs are bounded and independent random variables, not necessarily identically distributed, but with common expectations. We show that the completely mixed uniform strategy profile, i.e. the combination of mixed strategies (one per play...
متن کاملApproximate Nash Equilibria via Sampling
We prove that in a normal form n-player game with m actions for each player, there exists an approximate Nash equilibrium where each player randomizes uniformly among a set of O(logm+log n) pure strategies. This result induces an N log logN algorithm for computing an approximate Nash equilibrium in games where the number of actions is polynomial in the number of players (m = poly(n)), where N =...
متن کاملApproximate Equilibria in Games with Few Players
We study the problem of computing approximate Nash equilibria (ǫ-Nash equilibria) in normal form games, where the number of players is a small constant. We consider the approach of looking for solutions with constant support size. It is known from recent work that in the 2-player case, a 1 2 -Nash equilibrium can be easily found, but in general one cannot achieve a smaller value of ǫ than 1 2 ....
متن کاملNew Algorithms for Approximate Nash Equilibria in Bimatrix Games
We consider the problem of computing additively approximate Nash equilibria in noncooperative two-player games. We provide a new polynomial time algorithm that achieves an approximation guarantee of 0.36392. We first provide a simpler algorithm, that achieves a 0.38197-approximation, which is exactly the same factor as the algorithm of Daskalakis, Mehta and Papadimitriou.This algorithm is then ...
متن کاملAlgorithms for Approximations of Nash Equilibrium ( 2003 ; Lipton , Markakis , Mehta , 2006
Nash [13] introduced the concept of Nash equilibria in non-cooperative games and proved that any game possesses at least one such equilibrium. A well-known algorithm for computing a Nash equilibrium of a 2-player game is the Lemke-Howson algorithm [11], however it has exponential worst-case running time in the number of available pure strategies [15]. Recently, Daskalakis et al [4] showed that ...
متن کامل